Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP
نویسندگان
چکیده
منابع مشابه
On Domain-Specific Declarative Knowledge Representation and Database Languages
For knowledge acquisition and engineering tasks many logic based representations formalisms are available nowadays. However, most of them do not support the elicitation and representation of domain specific knowledge. On one hand building special systems, which supports these elicitation and representation tasks is a costly and cumbersome process. The direct implementation of inference mechanis...
متن کاملExploiting Partial Operand Knowledge
Conventional microprocessor designs treat register operands as atomic units. In such designs, no portion of an operand may be consumed until the entire operand has been produced. In practice, logic circuits and arithmetic units that generate some portion of an operand in advance of the remaining portions are both feasible and desirable, and have been employed in several existing designs. In thi...
متن کاملHeuristics for Hard ASP Programs
We define a new heuristic hDS for ASP, and implement it in the (disjunctive) ASP system DLV. The new heuristic improves the evaluation of Σ2 /Π P 2 hard ASP programs while maintaining the benign behaviour of the well-assessed heuristic of DLV on NP problems. We experiment with the new heuristic on QBFs. hDS significantly outperforms the heuristic of DLV on hard 2QBF problems. We compare also th...
متن کاملImproving DPLL Solver Performance with Domain-Specific Heuristics: the ASP Case
In spite of the recent improvements in the performance of the solvers based on the DPLL procedure, it is still possible for the search algorithm to focus on the wrong areas of the search space, preventing the solver from returning a solution in an acceptable amount of time. This prospect is a real concern e.g. in an industrial setting, where users typically expect consistent performance. To ove...
متن کاملExploiting Partial Knowledge for Efficient Model Analysis
The advancement of constraint solvers and model checkers has enabled the effective analysis of high-level formal specification languages. However, these typically handle a specification in an opaque manner, amalgamating all its constraints in a single monolithic verification task, which often proves to be a performance bottleneck. This paper addresses this issue by proposing a solving strategy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.306.9